Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
نویسندگان
چکیده
منابع مشابه
Synthetic Domain Theory and Models of Linear Abadi & Plotkin Logic
In a recent article [4] the first two authors and R.L. Petersen have defined a notion of parametric LAPL-structure. Such structures are parametric models of the equational theory PILLY , a polymorphic intuitionistic / linear type theory with fixed points, in which one can reason using parametricity and, for example, solve a large class of domain equations [4,5]. Based on recent work by Simpson ...
متن کاملLinear Abadi & Plotkin Logic
We present a formalization of a version of Abadi and Plotkin’s logic for parametricity for a polymorphic dual intuitionistic / linear type theory with fixed points, and show, following Plotkin’s suggestions, that it can be used to define a wide collection of types, including existential types, inductive types, coinductive types and general recursive types. We show that the recursive types satis...
متن کاملLinear Abadi and Plotkin Logic
We present a formalization of a version of Abadi and Plotkin’s logic for parametricity for a polymorphic dual intuitionistic/linear type theory with fixed points, and show, following Plotkin’s suggestions, that it can be used to define a wide collection of types, including existential types, inductive types, coinductive types and general recursive types. We show that the recursive types satisfy...
متن کاملCategory-theoretic Models of Linear Abadi & Plotkin Logic
This paper presents a sound and complete category-theoretic notion of models for Linear Abadi & Plotkin Logic [Birkedal et al., 2006], a logic suitable for reasoning about parametricity in combination with recursion. A subclass of these called parametric LAPL structures can be seen as an axiomatization of domain theoretic models of parametric polymorphism, and we show how to solve general (nest...
متن کاملOperational Semantics and Models of Linear Abadi-Plotkin Logic
We present a model of Linear Abadi and Plotkin Logic for parametricity [8] based on the operational semantics of LILY, a polymorphic linear lambda calculus endowed with an operational semantics [3]. We use it to formally prove definability of general recursive types in LILY and to derive reasoning principles for the recursive types.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2006
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2005.11.058